Applications of optimization with Xpress-MP
نویسندگان
چکیده
منابع مشابه
Solving Hard Mixed-Integer Programming Problems with Xpress-MP: A MIPLIB 2003 Case Study
Over the past decade there has been a huge improvement in the performance of state-of-the-art MIP codes. Combined with the increased performance of computers over this period the size and complexity of the problems that can be solved has increased enormously. In this paper we take a closer look at some of the hardest problems in the MIPLIB 2003 library ([4]) to show how much progress has been m...
متن کاملOnline Pricing with Discounts by a Location Model
This paper investigates a model for pricing the demand for a set of goods when multiple suppliers operate discount schedules based on total business value. We formulate the buyerss decision problem as a mixed binary integer program (MIP) which is a generalization of the capacitated facility location problem (CFLP) and can be solved using Lagrangean heuristics. We have investigated commercially...
متن کاملMaximum patterns in datasets
Given a binary dataset of positive and negative observations, a positive (negative) pattern is a subcube having a nonempty intersection with the positive (negative) subset of the dataset, and an empty intersection with the negative (positive) subset of the dataset. Patterns are the key building blocks in Logical Analysis of Data (LAD), and are an essential tool in identifying the positive or ne...
متن کاملModeling & Solving Stochastic Programming Problems in Supply Chain Management using Xpress-SP
Supply chains continually face the challenge of efficient decision-making in a complex environment coupled with uncertainty. While plenty of forecasting and analytical tools are available in the market to evaluate and enhance Supply Chains’ performance, the current functionalities are not sufficient to address issues related to efficient decision making under uncertainty. In this paper we discu...
متن کاملSolving facility location models with modern optimization software: the weak and strong formulations revisited
It is well known that choosing a good formulation for a mixed-integer optimization model can drastically reduce its solution time with a linear-programming based branch-and-bound algorithm. Integer optimization software such as CPLEX and XPRESS-MP has progressed rapidly in recent years and implements powerful branchand-cut algorithms, combining branch-and-bound with cutting plane generation. In...
متن کامل